منابع مشابه
Topologically Sweeping Visibility Complexes via
This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal running time, this is the first optimal algorithm that uses only linear space. The visibility graph or ...
متن کاملSweeping an oval to a vanishing point
Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by orthogonal sweeps was first studied in [2]. Here we consider the following slanted variant of sweeping recently introduced in [1]: In a single sweep, the sweep-line is placed at a start position somewhere in the plane,...
متن کاملSpacetime Sweeping: An Interactive Dynamic Constraints Solver
This paper presents a new method for editing an existing motion to satisfy a set of user-specified constraints, and in doing so guaranteeing the kinematic and dynamic soundness of the transformed motion. We cast the motion editing problem as a constrained state estimation problem based on the per-frame Kalman filter framework. To handle various kinds of kinematic and dynamic constraints in a sc...
متن کاملTopologically Associating Domains: An invariant framework
Metazoan genomes are organized into regions of topologically associating domains (TADs). TADs are demarcated by border elements, which are enriched for active genes and high occupancy architectural protein binding sites. We recently demonstrated that 3D chromatin architecture is dynamic in response to heat shock, a physiological stress that downregulates transcription and causes a global redist...
متن کاملCut Sweeping
This paper presents a light-weight sweeping method, similar to SATand BDD-sweeping. Performance are on the order of 10x to 100x faster than SAT-sweeping for large designs, while achieving about 50-90% of the reductions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1989
ISSN: 0022-0000
DOI: 10.1016/0022-0000(89)90038-x